Local-Global Minimum Property in Unconstrained Minimization Problems
نویسنده
چکیده
The main goal of this paper is to prove some new results and extend some earlier ones about functions, which possess the so called local-global minimum property. In the last section, we show an application of these in the theory of calculus of variations.
منابع مشابه
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملMinimization of Transformed L_1 Penalty: Theory, Difference of Convex Function Algorithm, and Robust Application in Compressed Sensing
We study the minimization problem of a non-convex sparsity promoting penalty function, the transformed l1 (TL1), and its application in compressed sensing (CS). The TL1 penalty interpolates l0 and l1 norms through a nonnegative parameter a ∈ (0,+∞), similar to lp with p ∈ (0, 1]. TL1 is known in the statistics literature to enjoy three desired properties: unbiasedness, sparsity and Lipschitz co...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملOn the Global Convergence of the PERRY-SHANNO Method for Nonconvex Unconstrained Optimization Problems
In this paper, we prove the global convergence of the Perry-Shanno’s memoryless quasi-Newton (PSMQN) method with a new inexact line search when applied to nonconvex unconstrained minimization problems. Preliminary numerical results show that the PSMQN with the particularly line search conditions are very promising.
متن کاملA Derivative-Free Algorithm for Constrained Global Optimization Based on Exact Penalty Functions
Constrained global optimization problems can be tackled by using exact penalty approaches. In a preceding paper, we proposed an exact penalty algorithm for constrained problems which combines an unconstrained global minimization technique for minimizing a non-differentiable exact penalty function for given values of the penalty parameter, and an automatic updating of the penalty parameter that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Optimization Theory and Applications
دوره 162 شماره
صفحات -
تاریخ انتشار 2014